Skip sequencing: A decision problem in questionnaire design
نویسندگان
چکیده
منابع مشابه
Skip Sequencing: a Decision Problem in Questionnaire Design.
This paper studies questionnaire design as a formal decision problem, focusing on one element of the design process: skip sequencing. We propose that a survey planner use an explicit loss function to quantify the trade-off between cost and informativeness of the survey and aim to make a design choice that minimizes loss. We pose a choice between three options: ask all respondents about an item ...
متن کاملMinimizing the Mean Tardiness in A N1 Sequencing Problem
This paper considers the problem of minimizing the mean tardiness of N jobs when the jobs are scheduled on a single machine. A simple algorithmic procedure is develop to obtain an optimal or a near optimal sequence for the N jobs while considering an equal penalty cost incurred to each job delivered later than its due date. The developed algorithm is applied to the several test problems. The re...
متن کاملDesign and Implementation of SKIP
We present a key-distribution scheme that is particularly well suited for use in conjunction with a session-less datagram protocol such as IP or IPv6. We describe how this scheme can be used for both IP unicast and multicast applications, providing an approach for scalable multicast key distribution. We also describe an implementation of this scheme on the Solaris operating system, and present ...
متن کاملOn optimal mechanism design for a sequencing problem
We study mechanism design for a single server setting where jobs require compensation for waiting, while waiting cost is private information to the jobs. With given priors on the private information of jobs, we aim to find a Bayes-Nash incentive compatible mechanism that minimizes the total expected payments to the jobs. Following earlier work in the auction literature, we show that this proble...
متن کاملTwo Dimensional Optimal Mechanism Design for a Sequencing Problem
We consider optimal mechanism design for a sequencing problem with n jobs which require a compensation payment for waiting. The jobs’ processing requirements as well as unit costs for waiting are private data. Given public priors for this private data, we seek to find an optimal mechanism, that is, a scheduling rule and incentive compatible payments that minimize the total expected payments to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Statistics
سال: 2008
ISSN: 1932-6157
DOI: 10.1214/07-aoas134